package com.le.tester.leetcode;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.Map;

/**
 * createTime：2022/7/16 16:07
 * description：单词最长相同的字符
 */
public class CommonPrefix {
    public String longestCommonPrefix(String[] strs) {




//        Map<String, Integer> map = new HashMap<>();
//        String join = String.join(" ", strs);
//        System.out.println(join);
//        String joinStr = join.replaceAll(" ", "");
//        System.out.println(joinStr);
//        int length = joinStr.length();
//        for (int i = 0; i < length; i++) {
//            if (map.get())
//        }
        return null;
    }

    public static void main(String[] args) {
        String[] strs = new String[]{"flower", "flow", "flight"};
        new CommonPrefix().longestCommonPrefix(strs);
    }
}
